Random Matrices Generating Large Growth in LU Factorization with Pivoting
نویسندگان
چکیده
We identify a class of random, dense, $n\times n$ matrices for which LU factorization with any form pivoting produces growth factor typically size at least $n/(4 \log n)$ large $n$. The condition number the can be arbitrarily chosen, and also happens transpose. Previously, no all these properties were known. generated by MATLAB function gallery('randsvd',...), they are formed as product two random orthogonal from Haar distribution diagonal matrix having only one entry different 1, lies between 0 1 (the “one small singular value” case). Our explanation uses fact that maximum absolute value element distributed tends to relatively verify behavior numerically find partial actual is significantly larger than lower bound much observed elements uniform [0,1] or standard normal distributions. show more generally rank-1 perturbation an producing generates under reasonable assumptions. Finally, we demonstrate GMRES-based iterative refinement provide stable solutions $Ax = b$ when occurs in low precision factors, even cannot.
منابع مشابه
Parallel Symbolic Factorization for Sparse LU Factorization with Static Pivoting
In this paper we consider a direct method to solve a sparse unsymmetric system of linear equations Ax = b, which is the Gaussian elimination. This elimination consists in explicitly factoring the matrix A into the product of L and U , where L is a unit lower triangular matrix, and U is an upper triangular matrix, followed by solving LUx = b one factor at a time. One of the main characteristics ...
متن کاملParallel Symbolic Factorization for Sparse LU with Static Pivoting
This paper presents the design and implementation of a memory scalable parallel symbolic factorization algorithm for general sparse unsymmetric matrices. Our parallel algorithm uses a graph partitioning approach, applied to the graph of |A|+ |A| , to partition the matrix in such a way that is good for sparsity preservation as well as for parallel factorization. The partitioning yields a so-call...
متن کاملRandom matrices over a DVR and LU factorization
LetR be a discrete valuation ring (DVR) andK be its fraction field. IfM is a matrix overR admitting a LU decomposition, it could happen that the entries of the factors L and U do not lie in R, but just inK. Having a good control on the valuations of these entries is very important for algorithmic applications. In the paper, we prove that in average these valuations are not too large and explain...
متن کاملStability and sensitivity of tridiagonal LU factorization without pivoting
In this paper the accuracy of LU factorization of tridiagonal matrices without pivoting is considered. Two types of componentwise condition numbers for the L and U factors of tridiadonal matrices are presented and compared. One type is a condition number with respect to small relative perturbations of each entry of the matrix. The other type is a condition number with respect to small component...
متن کاملA Comparison of Pivoting Strategies for the Direct LU Factorization
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usual Gaussian elimination and show that two so-called total scaled and total pivoting strategies can be employed in addition to the traditional pivoting strategies: partial scaled, partial, and direct diagonal. In this paper we o er a general LU factorization with total scaled pivoting algorithm fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2021
ISSN: ['1095-7162', '0895-4798']
DOI: https://doi.org/10.1137/20m1338149